Coordinated path planning for multiple robots
نویسندگان
چکیده
منابع مشابه
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment. Rather than the usual decoupled planning, we use a coordinated approach. As a result we can show that the method is probabilistically complete, that is, any solvable problem will be solved within a nite amount of time...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملCoordinated Path Following for Mobile Robots
A control strategy for coordinated path following of multiple mobile robots is presented in this paper. A virtual vehicle concept is combined with a path following approach to achieve formation tasks. Our formation controller is proposed for the kinematic model of unicycle-type mobile robots. It is designed in such a way that the path derivative is employed as an additional control input to syn...
متن کاملNonmyopic Adaptive Informative Path Planning for Multiple Robots
Many robotic path planning applications, such as search and rescue, involve uncertain environments with complex dynamics that can be only partially observed. When selecting the best subset of observation locations subject to constrained resources (such as limited time or battery capacity) it is an important problem to trade off exploration (gathering information about the environment) and explo...
متن کاملPath Planning for Multiple Robots in Bi-connected Environments
This paper addresses a problem of path planning for multiple robots. A class of the problem with bi-connected environments is defined and a new polynomial-time solving algorithm for this class is proposed. It is shown in the paper that the new algorithm significantly outperforms the existing state-of-the-art domain-independent approaches and it is able to solve problems of real-life size. Intro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Robotics and Autonomous Systems
سال: 1998
ISSN: 0921-8890
DOI: 10.1016/s0921-8890(97)00033-x